Simultaneous packing and covering in the Euclidean plane II
نویسنده
چکیده
In 1950, C.A. Rogers introduced and studied the simultaneous packing and covering constants for a convex body and obtained the first general upper bound. Afterwards, they have attracted the interests of many authors such as L. Fejes Tóth, S.S. Rys̆kov, G.L. Butler, K. Böröczky, H. Horváth, J. Linhart and M. Henk since, besides their own geometric significance, they are closely related to the packing densities and the covering densities of the convex body, especially to the Minkowski-Hlawka theorem. However, so far our knowledge about them is still very limited. In this paper we will determine the optimal upper bound of the simultaneous packing and covering constants for two-dimensional centrally symmetric convex domains, and characterize the domains attaining the upper bound. MSC: primary 52C17; secondary 11H31
منابع مشابه
Packing and Covering by Translates of Certain Nonconvex Bodies
We develop techniques for determining the packing and covering constants for star bodies composed of cubes. In the theory of convex sets problems of tiling, packing, and covering by translates of a given set have a long history, with the main focus on the packing and covering by spheres. Only in a few cases is the densest packing or sparsest covering known, even in the case of the sphere, excep...
متن کاملOn the geometric dilation of curves and point sets
Let G be an embedded planar graph whose edges are curves. The detour between two points u and v (on edges or vertices) of G is the ratio between the shortest path in G between u and v and their Euclidean distance. The maximum detour over all pairs of points is called the geometric dilation δ(G). Ebbers-Baumann, Grüne and Klein have recently shown that every finite point set is contained in a pl...
متن کاملTranslative Packing of Unit Squares into Equilateral Triangles
Every collection of n (arbitrary-oriented) unit squares can be packed translatively into any equilateral triangle of side length 2.3755 ̈ ? n. Let the coordinate system in the Euclidean plane be given. For 0 ≤ αi ă π{2, denote by Spαiq a square in the plane with sides of unit length and with an angle between the x-axis and a side of Spαiq equal to αi. Furthermore, let T psq be an equilateral tr...
متن کاملOn Tightest Packings in the Minkowski Plane
is satisfied for any two distinct points P, Q of L. Since the work of Thue on circle packings in the plane, many people have noted that the mesh of a lattice is the inverse of the density of its points and have asked whether there are arbitrary pointsets of maximal density satisfying the packing condition. C. A. Rogers [8] showed in 1951, for example, that for the Euclidean plane no packing is ...
متن کاملThe Interval of Disk Packing Exponents1
The set of disk packing exponents is an interval equal to (£, 2] or [E, 2]. The set of triangle packing exponents is [log23,2]. The analogy strongly suggests that £ is attained and that E=S, the osculatory exponent whose value is known to lie in the interval 1.0300197<5<1.314534. 1. Literature survey and statement of theorems. Let U denote a disk of diameter 1 in the Euclidean plane. A countabl...
متن کامل